PROVABLY CONSISTENT DISTRIBUTED DELAUNAY TRIANGULATION

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constrained Delaunay Triangulation Using Delaunay Visibility

An algorithm for constructing constrained Delaunay triangulation (CDT) of a planar straight-line graph (PSLG) is presented. Although the uniform grid method can reduce the time cost of visibility determinations, the time needed to construct the CDT is still long. The algorithm proposed in this paper decreases the number of edges involved in the computation of visibility by replacing traditional...

متن کامل

Hexagonal Delaunay Triangulation

We present a novel and robust algorithm for triangulating point clouds in R. It is based on a highly adaptive hexagonal subdivision scheme of the input domain. That hexagon mesh has a dual triangular mesh with the following properties: • any angle of any triangle lies in the range between 43.9◦ and 90◦, • the aspect ratio of triangles is bound to 1.20787, • the triangulation has the Delaunay pr...

متن کامل

Parallel 3D Delaunay Triangulation

The paper deals with the parallelization of Delaunay triangulation algorithms, giving more emphasis to pratical issues and implementation than to theoretical complexity. Two parallel implementations are presented. The first one is built on DeWall, an E triangulator based on an original interpretation of the divide & conquer paradigm. The second is based on an incremental construction algorithm....

متن کامل

Delaunay Triangulation of Manifolds

We present an algorithmic framework for producing Delaunay triangulations of manifolds. The input to the algorithm is a set of sample points together with coordinate patches indexed by those points. The transition functions between nearby coordinate patches are required to be bi-Lipschitz with a constant close to 1. The primary novelty of the framework is that it can accommodate abstract manifo...

متن کامل

Delaunay Triangulation Benchmarks

In this communication we propose an initial set of 2D Delaunay triangulation benchmarks for checking the correctness of algorithms and discovering possible flaws. A tool for verification of the generated triangulation is provided. The tool reports typical errors like the existence of unused points, missing edges, non-Delaunay triangles or degenerated triangles. While the tool has been primarily...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences

سال: 2020

ISSN: 2194-9050

DOI: 10.5194/isprs-annals-v-2-2020-195-2020